Modelling the navigation potential of a web page
نویسندگان
چکیده
Suppose that you are navigating in “hyperspace” and you have reached a web page with several outgoing links you could choose to follow. Which link should you choose in such an online scenario? One extreme case is that you know exactly where you are heading and you have no problem in choosing a link to follow. In all other cases, when you are not sure where the information you require resides, you will initiate a navigation (or “surfing”) session. This involves pruning (or discounting) some of the links and following one of the others, where more pruning is likely to happen the deeper you navigate. In terms of decision making, the utility of navigation diminishes with distance until finally the utility drops to zero and the session is terminated. Under this model of navigation, we call the number of nodes that are available after pruning, for browsing within a session, the potential gain of the starting web page. Thus the parameters that effect the potential gain are the local branching factor with respect to the starting web page and the discount factor. We first consider the case when the discounting factor is geometric. We show that the distribution of the effective number of links that the user can follow at each navigation step after pruning, i.e. the number of nodes added to the potential gain at that step, is given by the erf function, which is related to the probability density function for the Normal distribution. We derive an approximation to the potential gain of a web page and show that this is numerically a very accurate estimate. We also obtain lower and upper bounds on the potential gain. We then consider a harmonic discounting factor and show that, in this case, the potential gain at each step is closely related to the probability density function for the Poisson distribution. The potential gain has been applied to web navigation where, given no other information, it helps the user to choose a good starting point for initiating a surfing session. Another application is in social network analysis, where the potential gain could provide a novel measure of centrality.
منابع مشابه
designing and implementing a 3D indoor navigation web application
During the recent years, the need arises for indoor navigation systems for guidance of a client in natural hazards and fire, due to the fact that human settlements have been complicating. This research paper aims to design and implement a visual indoor navigation web application. The designed system processes CityGML data model automatically and then, extracts semantic, topologic and geometric...
متن کاملModelling And Implementing Macro Web Navigation Structures
From the three existing dimensions content objects, navigation and presentation of web pages, the navigation dimension is analysed. It consists of macro, meso and micro navigation. A conceptual approach to model and implement the macro navigation structure of web sites is presented. We start by enhancing a function decomposition diagram to model the macro navigation structure. The resulting gra...
متن کاملExploiting UML Extensibility in the Design of Web Applications
The application design and development methodologies based on UML are well-known, widely used in practice and proved to be critically important for object-oriented design. However, these methodologies and tools do not provide specific support for modelling issues peculiar to web application. This paper defines an UML extension capable to refine the design of the client part of web application. ...
متن کاملRED: A Model To Analyze Web Navigation Patterns
Internet has become a popular medium to get and provide information and services. Every user is a potential client, and every site a potential competitor. Surfing the Web produces a trace that hides important information concerning business opportunities and site usability issues. This paper discusses the use of an intelligent agent to interpret Web navigation history and act opportunistically ...
متن کاملThe Best Trail Algorithm for Assisted Navigation of Web Sites
We present an algorithm called the Best Trail Algorithm, which helps solve the hypertext navigation problem by automating the construction of memex-like trails through the corpus. The algorithm performs a probabilistic best-first expansion of a set of navigation trees to find relevant and compact trails. We describe the implementation of the algorithm, scoring methods for trails, filtering algo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 396 شماره
صفحات -
تاریخ انتشار 2008